Clustering of illustrations by atmosphere using a combination of supervised and unsupervised learning

The distribution of illustrations on social media, such as Twitter and Pixiv has increased with the growing popularity of animation, games, and animated movies. The "atmosphere" of illustrations plays an important role in user preferences. Classifying illustrations by atmosphere can be helpful for recommendations and searches. However, assigning clear labels to the elusive "atmosphere" and conventional supervised classification is not always practical. Furthermore, even images with similar colors, edges, and low-level features may not have similar atmospheres, making classification based on low-level features challenging. In this paper, this problem is solved using both supervised and unsupervised learning with pseudo-labels. The feature vectors are obtained using the supervised method with pseudo-labels that contribute to an ambiguous atmosphere. Further, clustering is performed based on these feature vectors. Experimental analyses show that our method outperforms conventional methods in human-like clustering on datasets manually classified by humans.Comment: 5 pages, 2 figure

HDR Image Watermarking

In this Chapter we survey available solutions for HDR image watermarking. First, we briefly discuss watermarking in general terms, with particular emphasis on its requirements that primarily include security, robustness, imperceptibility, capacity and the availability of the original image during recovery. However, with respect to traditional image watermarking, HDR images possess a unique set of features such as an extended range of luminance values to work with and tone-mapping operators against whom it is essential to be robust. These clearly affect the HDR watermarking algorithms proposed in the literature, which we extensively review next, including a thorough analysis of the reported experimental results. As a working example, we also describe the HDR watermarking system that we recently proposed and that focuses on combining imperceptibility, security and robustness to TM operators at the expense of capacity. We conclude the chapter with a critical analysis of the current state and future directions of the watermarking applications in the HDR domain

Trend-based Document Clustering for Sensitive and Stable Topic Detection

PACLIC / The University of the Philippines Visayas Cebu College Cebu City, Philippines / November 20-22, 200

SubPatch: Random kd-tree on a sub-sampled patch set for nearest neighbor field estimation

We propose a new method to compute the approximate nearest-neighbors field (ANNF) between image pairs using random kd-tree and patch set sub-sampling. By exploiting image coherence we demonstrate that it is possible to reduce the number of patches on which we compute the ANNF, while maintaining high overall accuracy on the final result. Information on missing patches is then recovered by interpolation and propagation of good matches. The introduction of the sub-sampling factor on patch sets also allows for setting the desired trade off between accuracy and speed, providing a flexibility that lacks in state-of-the-art methods. Tests conducted on a public database prove that our algorithm achieves superior performance with respect to PatchMatch (PM) and Coherence Sensitivity Hashing (CSH) algorithms in a comparable computational time

Solution structure of multi-domain protein ER-60 studied by aggregation-free SAXS and coarse-grained-MD simulation

Multi-domain proteins (MDPs) show a variety of domain conformations under physiological conditions, regulating their functions through such conformational changes. One of the typical MDPs, ER-60 which is a protein folding enzyme, has a U-shape with four domains and is thought to have different domain conformations in solution depending on the redox state at the active centres of the edge domains. In this work, an aggregation-free small-angle X-ray scattering revealed that the structures of oxidized and reduced ER-60 in solution are different from each other and are also different from those in the crystal. Furthermore, structural modelling with coarse-grained molecular dynamics simulation indicated that the distance between the two edge domains of oxidized ER-60 is longer than that of reduced ER-60. In addition, one of the edge domains has a more flexible conformation than the other